Longest path problem - PDFSEARCH.IO - Document Search Engine

Longest path problem
Results: 23

#	Item
11	November 18, Fall 2009 Quiz 2 Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2010-02-02 11:52:14 Network theory Edsger W. Dijkstra Graph connectivity Routing algorithms Spanning tree Graph Shortest path problem Strongly connected component Cycle Longest path problem Connected component FloydWarshall algorithm
12	December 15, Fall 2008 Final Examination Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2009-05-07 21:09:13 Graph theory Mathematics Computational complexity theory Network theory Spanning tree NP-complete problems Edsger W. Dijkstra Shortest path problem Longest path problem Minimum spanning tree Reverse-delete algorithm
13	Directing Complete Graphs and Avoiding Certain Structures January 31, 2015 The avoiding problem is defined as follows: the inputs consists of a simple Add to Reading List Source URL: payam-research.atwebpages.com Language: English - Date: 2015-01-31 03:24:13 NP-complete problems Morphisms Longest path problem Network theory Graph homomorphism Graph theory Theoretical computer science Mathematics
14	Z3 Lab exercises Leonardo de Moura and Nikolaj Bjørner Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA {leonardo, nbjorner}@microsoft.com June 18, 2008 Add to Reading List Source URL: leodemoura.github.io Language: English - Date: 2015-05-19 13:22:05 Computational complexity theory Recreational mathematics Z3 Gray code Eight queens puzzle Sudoku Constraint satisfaction Bit array Longest path problem Mathematics Theoretical computer science NP-complete problems
15	Algorithms Lecture 19: Depth-First Search [Fa’14] Ts’ui Pe must have said once: I am withdrawing to write a book. And another time: I am withdrawing to construct a labyrinth. Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:54 Connected component Longest path problem Tree Graph Topological sorting Vertex Connectivity Edge contraction Aperiodic graph Graph theory Depth-first search Directed acyclic graph
16	ICS 161 — Algorithms — Spring 2005 — Final Exam Please answer the following eight questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write y Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-06-13 12:44:12 NP-complete problems Vertex cover NP-complete Longest common subsequence problem Minimum spanning tree Algorithm Path decomposition Edge coloring Theoretical computer science Computational complexity theory Mathematics
17	An O(ND) Difference Algorithm and Its Variations∗ EUGENE W. MYERS Department of Computer Science, University of Arizona, Tucson, AZ 85721, U.S.A. ABSTRACT Add to Reading List Source URL: xmailserver.org Language: English - Date: 2007-02-16 03:04:45 Operations research NP-complete problems Dynamic programming Equations Systems engineering Shortest path problem Longest common subsequence problem Graph Catalan number Mathematics Theoretical computer science Graph theory
18	Longest Paths in Planar DAGs in Unambiguous Log-Space Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-02 16:29:35 Directed acyclic graph Shortest path problem Graph coloring Planarity testing Tree Matroid theory Path decomposition Chromatic polynomial Graph theory Planar graphs Network theory
19	Longest Paths in Planar DAGs in Unambiguous Log-Space∗ Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar The Institute of Mathematical Sciences, Chennai, India. Email: {nutan,meena,prajakta}@imsc.res.in 13 Novem Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-03 17:31:15 Planar graphs Network theory Directed acyclic graph Graph coloring Shortest path problem Hypercube graph Planarity testing Hamiltonian path Tree Graph theory Theoretical computer science NP-complete problems
20	Chapter 6 Dynamic programming Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2006-10-03 04:59:37 Dynamic programming Operations research Mathematical optimization Equations Systems engineering Algorithm Shortest path problem Longest increasing subsequence Topological sorting Mathematics Applied mathematics Graph theory